Mirrored Traveling Tournament Problem: An Evolutionary Approach
نویسندگان
چکیده
The Mirrored Traveling Tournament Problem (mTTP) is an optimization problem that represents certain types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of hybrid heuristic to solve the mTTP, using an evolutionary algorithm in association with the metaheuristic Simulated Annealing. It suggests the use of Genetic Algorithm with a compact genetic codification in conjunction with an algorithm to expand the code. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.
منابع مشابه
A Parallel Simulated Annealing Approach for the Mirrored Traveling Tournament Problem
The Traveling Tournament Problem (TTP) is a benchmark problem in sports scheduling and has been extensively studied in recent years. The Mirrored Traveling Tournament Problem (mTTP) is variation of the TTP that represents certain types of sports scheduling problems where the main objective is to minimize the total distance traveled by all the participating teams. In this paper we test a paralle...
متن کاملA Sport Tournament Scheduling by Genetic Algorithm with Swapping Method
A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either the total number of traveling or the total distances of traveling or both. This research aims to find an optimized solution of the mirrored Traveling Tournament Problem with minimum total num...
متن کاملA 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the norepeater and mirrored co...
متن کاملMaximizing breaks and bounding solutions to the mirrored traveling tournament problem
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization problem are equivalent when the distance between every pair of teams is equal to 1. We show how to construct schedules with a maximum number of breaks for some tournament types. The connection between breaks maximizati...
متن کاملClustering Search Approach for the Traveling Tournament Problem
The Traveling Tournament Problem (TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called Clustering Search (*CS), that consists in detecting supposed promising search areas based on clustering. The valid...
متن کامل